Vertex Cover Kernelization Revisited
نویسندگان
چکیده
منابع مشابه
Propagation via Kernelization: The Vertex Cover Constraint
The technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k. Besides being the basis for efficient parameterized algorithms, this method also provides a wealth of information to reason about in the context of constraint programming. We study the use of kernelization for designing propagators thro...
متن کاملSmaller Parameters for Vertex Cover Kernelization
We revisit the topic of polynomial kernels for Vertex Cover relative to structural parameters. Our starting point is a recent paper due to Fomin and Str{\o}mme [WG 2016] who gave a kernel with $\mathcal{O}(|X|^{12})$ vertices when $X$ is a vertex set such that each connected component of $G-X$ contains at most one cycle, i.e., $X$ is a modulator to a pseudoforest. We strongly generalize this re...
متن کاملVertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
Kernelization is a concept that enables the formal mathematical analysis of data reduction through the framework of parameterized complexity. Intensive research into the Vertex Cover problem has shown that there is a preprocessing algorithm which given an instance (G, k) of Vertex Cover outputs an equivalent instance (G′, k′) in polynomial time with the guarantee that G′ has at most 2k′ vertice...
متن کاملVertex Cover Structural Parameterization Revisited
A pseudoforest is a graph whose connected components have at most one cycle. Let X be a pseudoforest modulator of graph G, i. e. a vertex subset of G such that G−X is a pseudoforest. We show that Vertex Cover admits a polynomial kernel being parameterized by the size of the pseudoforest modulator. In other words, we provide a polynomial time algorithm that for an input graph G and integer k, ou...
متن کاملKernelization as Heuristic Structure for the Vertex Cover Problem
For solving combinatorial optimisation problems, exactmethods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation or heuristic methods are tractable for very large problems butmay possibly be led into a bad solution. A question that arises is, From where can we obtain knowledge of the problem structure via exact methods that can be exploite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2012
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-012-9393-4